Bottom-Up Logic Programming for Multicores

نویسندگان

  • Flavio Cruz
  • Michael P. Ashley-Rollman
  • Seth Copen Goldstein
  • Ricardo Rocha
  • Frank Pfenning
چکیده

In the Claytronics project, we have used Meld, a logic programming language suitable for writing scalable and concise distributed programs for ensembles. Meld allows declarative code to be compiled into distributed code that can be executed in thousands of computing units. We are now using Meld to program more traditional algorithms that run on multicore machines. We made several modifications to the core language, to the compiler and to the runtime system to take advantage of the characteristics of the target architecture. Our experimental results show that the new compiler and runtime system are capable of exploiting implicit parallelism in programs such as graph algorithms, neural networks and belief propagation algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Or-Parallel Prolog Execution on Clusters of Multicores

Logic Programming languages, such as Prolog, provide an excellent framework for the parallel execution of logic programs. In particular, the inherent non-determinism in the way logic programs are structured makes Prolog very attractive for the exploitation of implicit parallelism. One of the most noticeable sources of implicit parallelism in Prolog programs is or-parallelism. Or-parallelism ari...

متن کامل

An Or-Parallel Prolog Execution Model for Clusters of Multicores

Logic Programming languages, such as Prolog, offer a great potential for the exploitation of implicit parallelism. One of the most distinguishable sources of implicit parallelism in Prolog programs is orparallelism. Or-parallelism arises from the simultaneous evaluation of a subgoal call against the clauses that match that call. Arguably, or-parallel Prolog systems based on the environment copy...

متن کامل

A Formulation of Deterministic Bottom - UpParsing and Parser Generation In

This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for a logic programming langua...

متن کامل

A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language

This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for Prolog is described, altho...

متن کامل

Semantics for Temporal Annotated Constraint Logic Programming

We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011